Sufficient Conditions for a Digraph to be Supereulerian

A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs.     

Donaldson–Friedman construction and deformations of a triple of compact complex spaces,II

In a previous paper of the same title the author gave a generalization of the constrution of Donaldson–Friedman, to prove the existence of twistor spaces of n CP ² with a special kind of divisors. In the present paper, we consider its equivariant version. When n = 3, this gives another proof of the existence of degenerate double solid with C *–action, and we show that the branch quartic surface is birational to an elliptic ruled surface. In case n ≥ 4, this yields new Moishezon twistor spaces with C *–action, which is shown to be the most degenerate ones among twistor spaces studied by Campana and Kreußler.     

Hamiltonian N2‐locally connected claw‐free graphs

A graph G is N₂‐locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent to ν in G induce a connected graph. In 1990, Ryjá?ek conjectured that every 3‐connected N₂‐locally connected claw‐free graph is Hamiltonian. This conjecture is proved in this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005     

矩阵对角相似的图论判别法

本文证明了任意两个ｎ阶复矩阵Ａ和Ｂ为对角相似的充要条件是：它们有相同的伴随有向图，并且以此有向图为基础有向图，以Ａ和Ｂ的对应非零元素比值为弧权值的赋权有向图满足“无向圈平衡条件”。我们还给出了矩阵对角相似条件在非负矩阵谱理论研究中的一个应用。     

On Characterizations of Proper Efficiency for Nonconvex Multiobjective Optimization

In this paper, nonconvex multiobjective optimization problems are studied. New characterizations of a properly efficient solution in the sense of Geoffrion's are established in terms of the stability of one scalar optimization problem and the existence of an exact penalty function of a scalar constrained program, respectively. One of the characterizations is applied to derive necessary conditions for a properly efficient control-parameter pair of a nonconvex multiobjective discrete optimal control problem with linear constraints.     

有界连通区域上Dirichlet空间及其算子

本文主要讨论了有界连通区域Dirichlet空间上Toeplitz算子的Fredholm性质,计算了符号在C1中的Toeplitz算子的本性谱和Fredholm指标．     

A new method for constructing infinite families of k-tight optimal double loop networks

The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. DLN has been widely used in the designing of local area networks and distributed systems. In this paper, a new method for constructing infinite families of k-tight optimal DLN is presented. For k = 0,1,…,40, the infinite families of k-tight optimal DLN can be constructed by the new method, where the number nk(t,a) of their nodes is a polynomial of degree 2 in t and contains a parameter a. And a conjecture is proposed.     

全纯扩充的BHW定理的推广

本文得到关于全纯扩充的BHW定理的一个全新的证明,同时也对BHW定 理做出了更一般的推广,并且给出了推广后的BHW定理的两种不同的证明方法.